Pointer Analysis

Pointer analysis is a fundamental static program analysis, with a rich literature and wide applications. The goal of pointer analysis is to compute an approximation of the set of program objects that a pointer variable or expression can refer to. We present an introduction and survey of pointer analysis techniques, with an emphasis on distilling the essence of common analysis algorithms. To this end, we focus on a declarative presentation of a common core of pointer analyses: algorithms are modeled as configurable, yet easy-to-follow, logical specifications. The specifications serve as a starting point for a broader discussion of the literature, as independent threads spun from the declarative model. Y. Smaragdakis and G. Balatsouras. Pointer Analysis. Foundations and Trends © in Programming Languages, vol. 2, no. 1, pp. 1–69, 2015. DOI: 10.1561/2500000014.